Revisiting Calculation of Moments of Number of Comparisons used by the Randomized Quick Sort Algorithm

Asymptotic expressions for moments of number of comparisons used by the randomized quick sort algorithm

We revisit the method of Kirschenhofer, Prodinger and Tichy to calculate asymptotic expressions for the moments of number of comparisons used by the randomized quick sort algorithm.

Asymptotic expansions for factorial moments of some distributions in the analysis of algorithms

We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort algorithm. To achieve this we use singularity analysis of certain type of generating functions due to Flajolet and Odlyzko.

Neural Network Performance Analysis for Real Time Hand Gesture Tracking Based on Hu Moment and Hybrid Features

This paper presents a comparison study between the multilayer perceptron (MLP) and radial basis function (RBF) neural networks with supervised learning and back propagation algorithm to track hand gestures. Both networks have two output classes which are hand and face. Skin is detected by a regional based algorithm in the image, and then networks are applied on video sequences frame by frame in...

Introduction to Randomized Algorithms: Quick Sort and Quick Selection

Introduction to Randomized Algorithms: Quick Sort and Quick Selection